class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        res = 1
        for i in range(1,min(m, n)):
            res *= (m+n-1-i)
            res /= i
        return int(res)


a = Solution()
print(a.uniquePaths(3, 7))